Bilattices In Logic Programming
نویسنده
چکیده
Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is presented, so the paper is relatively self-contained.
منابع مشابه
Interval Bilattices and Some Other Simple Bilattices
In a number of papers M.Ginsberg introduced algebras called bilattices having two separate lattice structure and one additional basic unary operation. They originated as an algebraization of some nonclassical logics that arise in artificial intelligence and knowledge-based logic programming. In this paper we introduce some new class of bilattices which originate from interval lattices and show ...
متن کاملThe Structure of Interlaced Bilattices
Bilattices were introduced and applied by Ginsberg and Fitting for a diversity of applications, such as truth maintenance systems, default inferences and logic programming. In this paper we investigate the structure and properties of a particularly important class of bilattices called interlaced bilattices (introduced by Fitting). The main results are that every interlaced bilattice is isomorph...
متن کاملBilattices, Intuitionism and Truth-knowledge Duality: Concepts and Foundations
We propose a family of intuitionistic bilattices with full truth-knowledge duality (D-bilattices) for a logic programming. The first family of perfect D-bilattices is composed by Boolean algebras with even number of atoms: the simplest of them, based on intuitionistic truth-functionally complete extension of Belnap’s 4-valued bilattice, can be used in paraconsistent programming, that is, for kn...
متن کاملSuperproducts, Hyperidentities, and Algebraic Structures of Logic Programming
Recent developments in logic programming are based on bilattices (algebras with two separate lattice structures). This paper provides characterizations and structural descriptions for bilattices using the algebraic concepts of superproduct and hyperidentity. The main structural description subsumes the many variants that have appeared in the literature.
متن کاملQuery Answering in Normal Logic Programs Under Uncertainty
We present a simple, yet general top-down query answering procedure for normal logic programs over lattices and bilattices, where functions may appear in the rule bodies. Its interest relies on the fact that many approaches to paraconsistency and uncertainty in logic programs with or without non-monotonic negation are based on bilattices or lattices, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990